CART: Constant Aspect Ratio Tiling
نویسندگان
چکیده
Parametric tiling is a well-known transformation which is widely used to improve locality, parallelism and granularity. However, parametric tiling is also a non-linear transformation and this prevents polyhedral analysis or further polyhedral transformation after parametric tiling. It is therefore generally applied during the code generation phase. In this paper, we present a method to remain polyhedral, in a special case of parametric tiling, where all the dimensions are tiled and all the tile sizes are constant multiples of a single tile size parameter. We call this Constant Aspect Ratio Tiling. We show how to mathematically transform a polyhedron and an affine function into their tiled counterpart, which are the two main operations needed in such transformation.
منابع مشابه
Optimizing Dynamic Resource Allocation
We present a formulation, solution method, and program acceleration techniques for two dynamic control scenarios, both with the common goal of optimizing resource allocations. These approaches allocate resources in a non-myopic way, accounting for long-term impacts of current control decisions via nominal belief-state optimization (NBO). In both scenarios, the solution techniques are paralleliz...
متن کامل4 An algorithm for two - dimensional mesh generation based on the pinwheel tiling ∗
We propose a new two-dimensional meshing algorithm called PINW able to generate meshes that accurately approximate the distance between any two domain points by paths composed only of cell edges. This technique is based on an extension of pinwheel tilings proposed by Radin and Conway. We prove that the algorithm produces triangles of bounded aspect ratio. This kind of mesh would be useful in co...
متن کاملInterference Lattice-based Loop Nest Tilings for Stencil Computations
A common method for improving performance of stencil operations on structured multi-dimensional discretization grids is loop tiling. Tile shapes and sizes are usually determined heuristically, based on the size of the primary data cache. We provide a lower bound on the numbers of cache misses that must be incurred by any tiling, and a close achievable bound using a particular tiling based on th...
متن کاملImproving spatial coverage while preserving the blue noise of point sets
We explore the notion of a Well-spaced Blue-noise Distribution (WBD) of points, which combines two desirable properties. First, the point distribution is random, as measured by its spectrum having blue noise. Second, it is well-spaced in the sense that the minimum separation distance between samples is large compared to the maximum coverage distance between a domain point and a sample, i.e. its...
متن کاملTwo-dimensional packing algorithms for layout of disconnected graphs
We present and contrast several efficient two-dimensional packing algorithms for specified aspect ratio. These near-linear algorithms are based on strip packing, tiling, and alternate-bisection methodologies and can be used in the layout of disconnected objects in graph visualization. The parameters that affect the performance of these algorithms as well as the circumstances under which they pe...
متن کامل